Tradeoffs in the inductive inference of nearly minimal size programs

Inductive inference machines are algorithmic devices which attempt to synthesize (in the limit) programs for a function while they examine more and more of the graph of the function. There are many possible criteria of success. We study the inference of nearly minimal size programs. Our principal results imply that nearly minimal size programs can be inferred (in the limit) without loss of inferring power provided we are willing to tolerate a finite, but not uniformly, bounded, number of anomalies in the synthesized programs. On the other hand, there is a severe reduction of inferring power in inferring nearly minimal size programs if the maximum number of anomalies allowed is any uniform constant. We obtain a general characterization for the classes of recursive functions which can be synthesized by inferring nearly minimal size programs with anomalies. We also obtain similar results for Popperian inductive inference machines. The exact tradeoffs between mind change bounds on inductive inference machines and anomalies in synthesized programs are obtained. The techniques of recursive function theory including the recursion theorem are employed

A Step toward Compositional Semantics: E-HowNet a Lexical Semantic Representation System

PACLIC 23 / City University of Hong Kong / 3-5 December 200

Chapter V: Verbs

This monograph is a translation of two seminal works on corpus-based studies of Mandarin Chinese words and parts of speech. The original books were published as two pioneering technical reports by Chinese Knowledge and Information Processing group (CKIP) at Academia Sinica in 1993 and 1996, respectively. Since then, the standard and PoS tagset proposed in the CKIP report have become the de facto standard in Chinese corpora and computational linguistics, in particular in the context of traditional Chinese texts. This new translation represents and develops the principles and theories originating from these pioneering works. The results can be applied to numerous fields; Chinese syntax and semantics, lexicography, machine translation and other language engineering bound applications

Semantic Representation and Composition for Unknown Compounds in E-HowNet

PACLIC 20 / Wuhan, China / 1-3 November, 200

Modality and Modal Sense Representation in E-HowNet

PACLIC 21 / Seoul National University, Seoul, Korea / November 1-3, 200

Chapter T: Particles

This monograph is a translation of two seminal works on corpus-based studies of Mandarin Chinese words and parts of speech. The original books were published as two pioneering technical reports by Chinese Knowledge and Information Processing group (CKIP) at Academia Sinica in 1993 and 1996, respectively. Since then, the standard and PoS tagset proposed in the CKIP report have become the de facto standard in Chinese corpora and computational linguistics, in particular in the context of traditional Chinese texts. This new translation represents and develops the principles and theories originating from these pioneering works. The results can be applied to numerous fields; Chinese syntax and semantics, lexicography, machine translation and other language engineering bound applications